Search results
47 packages found
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
- bloom
- filter
- bloom filter
- probabilistic
- datastructure
- partitionned bloom filter
- scalable bloom filter
- counting bloom filter
- invertible bloom filter
- count min sketch
- cuckoo
- xor
- minhash
- top-k
Space efficient bloom filter based on the bloom-filters npm package.
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
A lightweight, performant bloom filter implementation with a simple API
Yet another Bloom filter implementation, this one with xxhashjs
a fast javascript counting bloom filter implementation
a fast javascript counting bloom filter implementation
Space efficient bloom filter based on the bloom-filters npm package.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
This is a fork of bloomfilter.js to address a couple issues.
Bloom filter is a space efficient probablistic data-structure. This implementation relies on following non-cryptographic hash functions. - Fowler–Noll–Vo hash function. - Jenkins hash function.
Bloom filter for Buffers, optimized for crazy speed.
Fast, reliable cuckoo hash table for Node.js
- array
- associative
- binary
- bloom
- buffer
- bucket
- bucketized
- cache
- clock
- container
- cuckoo
- element
- filter
- flood
- View more
Yet another Bloom filter implementation, this one with farmhash
Asino, a stubborn, simple and fast Bloom filter for the rest of us.
Stream-based bloom filter implementation
a generic bloom filter with parameterizable hash functions